Lattice Attacks in Cryptography: A Partial Overview
نویسنده
چکیده
In this work, we give a partial overview of lattice attacks in cryptography. While different kinds of attacks are considered, the emphasis of this work is given to attacks that are based on Coppersmith’s results for solving low degree multivariate modular equations and bivariate integer equations.
منابع مشابه
A New Lattice Construction for Partial Key Exposure Attack for RSA
In this paper we present a new lattice construction for a lattice based partial key exposure attack for the RSA cryptography. We consider the situation that the RSA secret key d is small and a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. We show that our lattice construction is theoretically more efficient than known attacks proposed in [2, 7].
متن کاملNew lattice construction for partial key exposure attack for RSA
In this paper we present a new lattice construction for a lattice based partial key exposureattack for the RSA cryptography. We consider the situation that the RSA secret key d is smalland a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. Weshow that our lattice construction is theoretically more efficient than known attacks proposedin ...
متن کامل1342 - 2812 A new lattice construction for partial key exposure attack for RSA ( revised ) Yoshinori Aono
In this paper we present a new lattice construction for a lattice based partial key exposure attack for the RSA cryptography. We consider the situation that the RSA secret key d is small and a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. We show that our lattice construction is theoretically more efficient than known attacks proposed in [2, 7]. This is ...
متن کاملPractical Cryptanalysis of a Public-Key Encryption Scheme Based on Non-linear Indeterminate Equations at SAC 2017
We investigate the security of a public-key encryption scheme, the Indeterminate Equation Cryptosystem (IEC), introduced by Akiyama, Goto, Okumura, Takagi, Nuida, and Hanaoka at SAC 2017 as postquantum cryptography. They gave two parameter sets PS1 (n, p, deg X, q) = (80, 3, 1, 921601) and PS2 (n, p, deg X, q) = (80, 3, 2, 58982400019). The paper gives practical key-recovery and message-recover...
متن کاملNew Partial Key Exposure Attacks on RSA Revisited
At CRYPTO 2003, Blömer and May presented new partial key exposure attacks against RSA. These were the first known polynomial-time partial key exposure attacks against RSA with public exponent e > N . Attacks for known most significant bits and known least significant bits were presented. In this work, we extend their attacks to multi-prime RSA. For r-prime RSA, these result in the first known p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004